A new heuristic for the traveling salesman problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA new heuristic procedure to solve the Traveling Salesman problem
This paper presents a heuristic technique that uses the Wang Recurrent Neural Network with the "Winner Takes All" principle to solve the Traveling Salesman Problem. When the Wang Neural Network presents solutions for the Assignment Problem with all constraints satisfied, the "Winner Takes All" principle is applied to the values in the Neural Network’s decision variables, with the additional con...
متن کاملA heuristic for the pickup and delivery traveling salesman problem
This paper deals with the pickup and delivery traveling salesman problem. First we show how to adapt some classical traveling salesman heuristics to solve this problem, then we propose a new and e$cient composite heuristic. The proposed heuristic is composed of two phases: a solution construction phase including a local optimization component and a deletion and re-insertion improvement phase. T...
متن کاملA Heuristic for the Resource-Constrained Traveling Salesman Problem
The Resource-Constrained Traveling Salesman Problem (RCTSP) is formulated as follows. A set of n cities is given (denoted by V ); travelling from city i to city j incurs cost cij as well as resource consumption rij . The objective is to find a minimum cost Hamilton cycle (or tour) that consumes not more than Rmax units of the resource, where Rmax is some constant. The cost (resource consumption...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1990
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1990240302451